Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
951	Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:46:04 Graph theory NP-complete problems Complexity classes Morphisms Graph coloring Graph homomorphism Matching P versus NP problem Vertex cover Theoretical computer science Mathematics Computational complexity theory
952	Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-11 20:52:11 Graph theory Computational problems NP-complete problems Constraint programming Graph coloring 2-satisfiability NP-complete Graph homomorphism Constraint satisfaction problem Theoretical computer science Mathematics Computational complexity theory
953	How a Generative Encoding Fares as Problem-Regularity Decreases Jeff Clune1, Charles Ofria1, and Robert T. Pennock1,2 Department of Computer Science and Engineering, Department of Philosophy & Lyman Briggs College Michig Add to Reading List Source URL: ofria.com Language: English - Date: 2013-02-07 15:35:35 Genetic algorithms Machine learning Applied mathematics Artificial intelligence Neuroevolution HyperNEAT Computational neuroscience Compositional pattern-producing network Neural networks Evolutionary algorithms Evolutionary computation
954	Progress in Computational Complexity Theory Hong Zhu† Computer Sciences Department, Fudan University Shanghai[removed], China. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-02-17 15:41:40 Complexity classes Probabilistic complexity theory Analysis of algorithms Finite fields NP-complete NP Randomized algorithm P Lattice problem Theoretical computer science Computational complexity theory Applied mathematics
955	Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed] Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2007-09-05 18:26:13 NP-complete problems Complexity classes Holographic algorithm NP-complete Matching FKT algorithm NP-hard P versus NP problem NP Theoretical computer science Computational complexity theory Mathematics
956	COUNTING LATTICE VECTORS DENIS XAVIER CHARLES Abstract. We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that t Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2005-01-20 18:37:07 Quadratic forms Lattice points Lie groups Cryptography Linear algebra Lattice Unimodular lattice Modular form Vector space Algebra Mathematics Abstract algebra
957	Twisting knobs and connecting things: Rethinking Technology & Creativity in the 21st Century By Danah Henriksen, Punya Mishra, & the Deep-Play Research Group Michigan State University Add to Reading List Source URL: punya.educ.msu.edu Language: English - Date: 2014-01-07 13:29:56 Cognition Educational psychology Positive psychology Psychology Cognitive science Computational creativity Problem solving Creativity Mind
958	Applied Inverse Problems: Theoretical and Computational Aspects UCLA Lake Arrowhead Conference Center Sunday, May 18, 2003 2:00 4:30 Add to Reading List Source URL: www.ipam.ucla.edu Language: English - Date: 2003-05-14 19:16:38 Mathematical analysis Scattering theory Geophysical imaging Medical imaging Inverse scattering problem Neuroimaging Inverse Seismic tomography Electrical impedance tomography Inverse problems Physics Medicine
959	Curriculum Vitae Palash Sarkar Professor Applied Statistics Unit Indian Statistical Institute Add to Reading List Source URL: www.isical.ac.in Language: English - Date: 2014-04-16 02:49:00 Indocrypt Fast Software Encryption Indian Statistical Institute Cryptographic hash function IEEE Transactions on Information Theory National Security Agency Diffie–Hellman problem Cryptography Computational hardness assumptions Finite fields

UPDATE